Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra1

The concept of neighbor system, introduced by Hartvigsen (2010), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of neighbor systems with jump systems and with bisubmodular polyhedra. We firstly prove that for every neighbor system, there exists a jump system which has the same neighborhood structure as the original neighbor system. This shows that the concept of neighbor system is essentially equivalent to that of jump system. We next show that the convex closure of a neighbor system is an integral bisubmodular polyhedron. In addition, we give a characterization of neighbor systems using bisubmodular polyhedra. Finally, we consider the problem of minimizing a separable convex function on a neighbor system. It is shown that the problem can be solved in weakly-polynomial time for a class of neighbor systems. An extended abstract of this paper appeared in Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Computer Science 6506, Springer 2010. Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan, [email protected]